TILDE Trees in the UNIX Environment

نویسندگان

  • Douglas E. Comer
  • Ralph E. Droms
  • Douglas Comer
چکیده

ABSrRACf TILDE is a multi-year research project exploring distributed computing in an environment where the primary computing engine consists of a cluster of UNIX·liket systems loosely coupled with high-speed local area networks. The goal of 'IU.DE is to extend UNIX to provide a transparent integration of local and remote facilities, allowing the user access to remote files and services without forcing the user to know about the location of data, processes, or other objects such as servers. One important aspect of TILDE is the Tilde naming scheme. The TILDE approach to naming objects in a distributed system provides a transparent, consistent mechanism-fol refer~!l.cing both local and remote objects.. The Tilde naming scheme substitutes a collection of directory hierarchies. known as Tilde trees. for the single UNIX directory hierarchy. A program executes in an environment composed of a forest of Tilde trees, which can be selected from the collection of Tilde trees known to the distributed computing system. In the prototype, each of the Tilde trees is mapped onto a UNIX subdirectory. As in UNIX, files are named either relative to the current working directory, or by a full pathp.ame. Full path names begin with tilde, and the first component identifies the appropriate Tilde tree, while the remainder of the t UNIX is a trademark of Bell Laboratories. ·2-pathname completely specifies the file within the Tilde tree. (The naming scheme c<:.n be viewed as an extension to C-sbeU naming mechanism.) A particular process executing within the TILDE system need not know the details of the storage organization or file location in the distributed '1O)'Stem; rather, there is a uniform mechanism for searching and accessing Tilde trees. This paper describes the naming scheme and a prototype implementation. It discusses alternative designs and compromises imposed by the limitations of a single-processor UNIX environment, as well as the impact of using the Tilde environment for tasks such as software development. We show how our Tilde naming software makes it possible to move large programs from one directory' to another or from one UNIX system to another without recompiling (even if path names have been bound into the code). Finally, future directions for this work, including extension to coUections of UNIX systems and modifications to include the Tilde tree naming system in the UNIX kernel, are also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON QUASI UNIVERSAL COVERS FOR GROUPS ACTING ON TREES WITH INVERSIONS

Abstract. In this paper we show that if G is a group acting on a tree X with inversions and if (T Y ) is a fundamental domain for the action of G on X, then there exist a group &tildeG and a tree &tildeX induced by (T Y ) such that &tildeG acts on &tildeX with inversions, G is isomorphic to &tilde G, and X is isomorphic to &tildeX. The pair (&tilde G &tildeX) is called the quasi universal cover...

متن کامل

Multi-relational data mining in Microsoft SQL

Most real life data are relational by nature. Database mining integration is an essential goal to be achieved. Microsoft SQL Server (MSSQL) seems to provide an interesting and promising environment to develop aggregated multi-relational data mining algorithms by using nested tables and the plug-in algorithm approach. However, it is currently unclear how these nested tables can best be used by d...

متن کامل

Top-down induction of logical decision trees

Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...

متن کامل

An Experimental Implementation of the Tilde Naming System

The Tilde naming system identifres files in a distributed computing system in a novel way, providing a consistent mechanism for referencing both local and remote files that is independent of the details of the underlying computing environment. The Tilde naming system achieves this independence by providing each user with control of a private name evaluation environment. In contrast, several con...

متن کامل

Using Logical Decision Trees for Clustering

A novel rst order clustering system, called C 0.5, is presented. It inherits its logical decision tree formalism from the TILDE system, but instead of using class information to guide the search, it employs the principles of instance based learning in order to perform clustering. Various experiments are discussed, which show the promise of the approach.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013